Approximation Algorithms for Energy, Reliability, and Makespan Optimization Problems
نویسندگان
چکیده
منابع مشابه
Approximation algorithms for energy, reliability and makespan optimization problems
In this paper, we consider the problem of scheduling an application on a parallel computational platform. The application is a particular task graph, either a linear chain of tasks, or a set of independent tasks. The platform is made of identical processors, whose speed can be dynamically modified. It is also subject to failures: if a processor is slowed down to decrease the energy consumption,...
متن کاملApproximation algorithms for NP-hard optimization problems
In this chapter, we discuss approximation algorithms for optimization problems. An optimization problem consists in finding the best (cheapest, heaviest, etc.) element in a large set P, called the feasible region and usually specified implicitly, where the quality of elements of the set are evaluated using a function f(x), the objective function, usually something fairly simple. The element tha...
متن کاملApproximation Algorithms for Geometric Optimization Problems
This thesis deals with a number of geometric optimization problems which are all NP-hard. The first problem we consider is the set cover problem for polytopes in R3. Here, we are given a set of points in R3 and a fixed set of translates of an arbitrary polytope. We would like to select a subset of the given polytopes such that each input point is covered by at least one polytope and the number ...
متن کاملApproximation Algorithms for Combinatorial Multicriteria Optimization Problems
The computational complexity of combinatorial multiple objective programming problems is investigated. INP-completeness and #P-completeness results are presented. Using two deenitions of approximability, general results are presented, which outline limits for approximation algorithms. The performance of the well known tree and Christoodes' heuristics for the TSP is investigated in the multicrit...
متن کاملAlgorithms Column: Approximation Algorithms for 2-Stage Stochastic Optimization Problems
Uncertainty is a facet of many decision environments and might arise for various reasons, such as unpredictable information revealed in the future, or inherent fluctuations caused by noise. Stochastic optimization provides a means to handle uncertainty by modeling it by a probability distribution over possible realizations of the actual data, called scenarios. The field of stochastic optimizati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Parallel Processing Letters
سال: 2016
ISSN: 0129-6264,1793-642X
DOI: 10.1142/s0129626416500018